base radixの例文

• These terms are sometimes used in technical jargon to represent some arbitrary yet common power of a base radix, typically when the number of trailing zeroes is not significant for the concept being discussed.
• Additional information will have to be associated with each key to indicate the population count or original order of any duplicate keys in a trie-based radix sort if keeping track of that information is important for a particular application.
• But, even a far more efficient sort ( such as a pointer-based radix sort, in this case ) is still likely to increase the elapsed time by more than 0.13 seconds, as you said . talk ) 23 : 53, 14 July 2008 ( UTC)